منابع مشابه
A Relative Timed Semantics for BPMN
We describe a relative-timed semantic model for Business Process Modelling Notation (BPMN). We define the semantics in the language of Communicating Sequential Processes (CSP). This model augments our untimed model by introducing the notion of relative time in the form of delays chosen non-deterministically from a range. We illustrate the application by an example. We also show some properties ...
متن کاملA Process Semantics for BPMN
Business Process Modelling Notation (BPMN), developed by the Business Process Management Initiative (BPMI), intends to bridge the gap between business process design and implementation. However, the specification of the notation does not include a formal semantics. This paper shows how a subset of the BPMN can be given a process semantics in Communicating Sequential Processes. Such a semantics ...
متن کاملA Precise Execution Semantics for BPMN
Bringing a high confidence to the validity of business processes is one of the prevailing themes in business process management. Regardless of the introduction of BPMN 1.2, there is no discernible improvement in the preciseness of the BPMN semantics. Motivated by the need to ensure the trustworthiness of BPMN models and the absence of an accurate behavioural semantics, a rigorous semantic defin...
متن کاملCoalgebraic semantics for timed processes
We give a coalgebraic formulation of timed processes and their operational semantics. We model time by a monoid called a “time domain”, and we model processes by “timed transition systems”, which amount to partial monoid actions of the time domain or, equivalently, coalgebras for an “evolution comonad” generated by the time domain. All our examples of time domains satisfy a partial closure prop...
متن کاملA Probabilistic Semantics for Timed Automata
Like most models used in model-checking, timed automata are an ideal mathematical model to represent systems with strong timing requirements. In such mathematical models, properties can be violated, due to unlikely events. Following ideas of Varacca and Völzer [VV06], we aim at defining a notion of “fair” correctness for timed systems. For this purpose, we introduce a probabilistic semantics fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2009
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2009.06.029